package com.nowc.week.w105_ak;

import java.util.*;

public class f {
    static int[][][][] last = new int[55][55][2505][];

    static {
        Queue<int[]> q = new LinkedList<>();
        for (int i = 1; i <= 50; i++) {
            q.add(new int[]{i, i});
            last[1][i][i] = new int[2];
        }
        for (int i = 1; i < 50; i++) {
            for (int p = q.size(); p != 0; p--) {
                int[] a = q.poll();
                for (int j = a[0]; j + a[1] <= 2500 && j <= 50; j += a[0]) {
                    if (last[i + 1][j][j + a[1]] == null) {
                        last[i + 1][j][j + a[1]] = a;
                        q.add(new int[]{j, j + a[1]});
                    }
                }
            }
        }
    }

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        for (int i = sc.nextInt(); i != 0; i--) {
            int n = sc.nextInt(), m = sc.nextInt(), x = sc.nextInt();
            boolean found = false;
            for (int j = 1; j <= m; j++) {
                if (last[n][j][x] != null) {
                    found = true;
                    for (int k = n, cur[] = new int[]{j, x}; k != 0; cur = last[k][cur[0]][cur[1]], k--) {
                        System.out.print(cur[1] - last[k][cur[0]][cur[1]][1] + " ");
                    }
                    System.out.println();
                    break;
                }
            }
            if (!found) {
                System.out.println(-1);
            }
        }
    }
}